This patch breaks the limit of IDs for Aet Sets in aet_db by reworking the way those entries are looked up.

By default, what the game does is:

• Read all aet_db files;
• Create a vector of Aet Set entries, sorted by ID;
• Allocate an array of pointers the size of the greatest ID and set the pointer of each entry in that vector in the appropriate slot in this array.

This lookup array makes the game crash when using big IDs for Aet Sets as the game tries to allocate too much memory. Instead, what this patch does is remove this lookup array and search for the entry directly in the sorted vector created previous to it.

Advantages:

• Now allowed to use Murmurhashes IDs
• Lower memory usage

Disadvantages:

• Slower lookup speed (from O(1) to O(log N), as it uses binary search, but realistically the difference should be almost null)